Detection of Cellular Aging in a Galton-watson Process
نویسندگان
چکیده
We consider the bifurcating Markov chain model introduced by Guyon to detect cellular aging from cell lineage. To take into account the possibility for a cell to die, we use an underlying Galton-Watson process to describe the evolution of the cell lineage. We give in this more general framework a weak law of large number, an invariance principle and thus fluctuation results for the average over one generation or up to one generation. We also prove the fluctuations over each generation are independent. Then we present the natural modifications of the tests given by Guyon in cellular aging detection within the particular case of the auto-regressive model.
منابع مشابه
The lineage process in Galton-Watson trees and globally centered discrete snakes
We consider branching random walks built on Galton-Watson trees with offspring distribution having a bounded support, conditioned to have n nodes, and their rescaled convergences to the Brownian snake. We exhibit a notion of “globally centered discrete snake” that extends the usual settings in which the displacements are supposed centered. We show that under some additional moment conditions, w...
متن کاملPruning Galton-Watson Trees and Tree-valued Markov Processes
Abstract. We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process {G(u)} by pruning Galton-Watson trees and an analogous process {G(u)} by pruning a critical or subcritical Galton-Watson tree conditioned to be infinite. Under a mild condition on offspring distributions, we show that ...
متن کاملConditioned Galton–Watson trees do not grow
A conditioned Galton–Watson tree is a random rooted tree that is (or has the same distribution as) the family tree of a Galton–Watson process with some given offspring distribution, conditioned on the total number of vertices. We let ξ be a random variable with the given offspring distribution; i.e., the number of offspring of each individual in the Galton–Watson process is a copy of ξ. We let ...
متن کاملTree-valued Markov Chains Derived from Galton-watson Processes
Let G be a Galton-Watson tree, and for 0 u 1 let Gu be the subtree of G obtained by retaining each edge with probability u. We study the tree-valued Markov process (Gu; 0 u 1) and an analogous process (G u; 0 u 1) in which G 1 is a critical or subcritical Galton-Watson tree conditioned to be in nite. Results simplify and are further developed in the special case of Poisson( ) o spring distribut...
متن کاملBootstrap percolation on Galton–Watson trees
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number r, the r-neighbour bootstrap process is an update rule for vertices of a graph in one of two states: ‘infected’ or ‘healthy’. In consecutive rounds, each healthy vertex with at least r infected neighbours becomes itself infected. Percolat...
متن کامل